Aperiodic Servers with Resource Constraints
نویسندگان
چکیده
منابع مشابه
Maximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملSchedulability analysis of periodic and aperiodic tasks with resource constraints
In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic environment, where tasks are scheduled based on their deadlines. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. Ape...
متن کاملGuaranteeing Schedulability with Server Mechanisms for RTOS Overheads
We propose techniques for guaranteeing schedulability including RTOS runtime overhead. In the techniques, we introduce two servers with planned capacity: periodic management server for invoking periodic tasks and aperiodic management server for aperiodic events such as task completion. Then, we provide the schedulability test considering the servers’ utilization. In addition, we show techniques...
متن کاملSharing Resources among Periodic and Aperiodic Tasks with Dynamic Deadlines
In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic environment, where tasks are scheduled based on their deadlines. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. A t...
متن کاملServer Time complexity Space complexity
We consider a simulation tool for the study of scheduling algorithms for real-time systems composed of periodic and aperiodic tasks. We rst introduce the scheduling problem of real-time systems, we present popular scheduling algorithms for periodic tasks with hard deadlines, and then we consider the case of mix systems, composed of periodic as well aperiodic tasks and we brieey present the vari...
متن کامل